-
1 cluster
кластер, скопление ( нестабильная коррелированная группа частиц)несколько, два или более, объектов водоотведения (напр., два завода, сбрасывающих сточные воды)гнездо ( терминалов)кластер, агломерация, группа населённых мест1. ( абонентская) группа, кластер (группа абонентов в ПРС, которые могут вступать между собой в связь непосредственно, а с другими абонентами ПРС - через центральный [главный] узел и переходные узлы [шлюзы] группы);2. группа отсчётов в выборке, кластер; см. также clusterhead; cluster link; cluster linkage; disjoint clusters; gateway; intercluster routing; intracluster routing; linked cluster algorithm; linked cluster architecture; overlapping clusters; primary cluster; secondary cluster; superclusterнесколько ( два или более) объектов водоотведения или забора воды (напр., два завода, сбрасывающих сточные воды в один водный объект)Англо-русский словарь промышленной и научной лексики > cluster
-
2 LCA
link cluster algorithm — алгоритм связанных ( абонентских) группlogic cell array — матрица логических элементов, архитектура LCA ( ЛЭМ)
См. также в других словарях:
Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… … Wikipedia
Cluster-Analyse — Unter Clusteranalyse (der Begriff Ballungsanalyse wird selten verwendet) versteht man strukturentdeckende, multivariate Analyseverfahren zur Ermittlung von Gruppen (Clustern) von Objekten, deren Eigenschaften oder Eigenschaftsausprägungen… … Deutsch Wikipedia
OPTICS algorithm — OPTICS ( Ordering Points To Identify the Clustering Structure ) is an algorithm for finding density based clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, Hans Peter Kriegel and Jörg Sander[1]. Its basic idea is… … Wikipedia
Computer cluster — Not to be confused with data cluster. A computer cluster is a group of linked computers, working together closely thus in many respects forming a single computer. The components of a cluster are commonly, but not always, connected to each other… … Wikipedia
Beowulf cluster — The Borg, a 52 node Beowulf cluster used by the McGill University pulsar group to search for pulsations from binary pulsars A Beowulf cluster is a computer cluster of what are normally identical, commodity grade computers networked into a small… … Wikipedia
Split multi-link trunking — (SMLT) is a link aggregation technology in computer networking designed by Nortel in 2001 as an enhancement to standard Multi Link Trunking (MLT) as defined in IEEE 802.3ad.Link aggregation or Multi Link Trunking (MLT) allows multiple physical… … Wikipedia
Single-linkage clustering — In cluster analysis, single linkage, nearest neighbour or shortest distance is a method of calculating distances between clusters in hierarchical clustering. In single linkage, the distance between two clusters is computed as the distance between … Wikipedia
Hierarchische Clusteranalyse — Als Hierarchische Clusteranalyse bezeichnet man eine bestimmte Familie von distanzbasierten Verfahren zur Clusteranalyse (Strukturentdeckung in Datenbeständen). Cluster bestehen hierbei aus Objekten, die zueinander eine geringere Distanz (oder… … Deutsch Wikipedia
List of ad-hoc routing protocols — An Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices in a mobile ad hoc network (MANET).In ad hoc networks , nodes do not have a priori knowledge of… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
DBSCAN — (for density based spatial clustering of applications with noise) is a data clustering algorithm proposed by Martin Ester, Hans Peter Kriegel, Jörg Sander and Xiaowei Xu in 1996.[1] It is a density based clustering algorithm because it finds a… … Wikipedia